On Generalised Abundance, I
نویسندگان
چکیده
منابع مشابه
Generalised Weber Functions. I
A generalised Weber function is given by wN (z) = η(z/N)/η(z), where η(z) is the Dedekind function and N is any integer; the original function corresponds to N = 2. We classify the cases where some power w N evaluated at some quadratic integer generates the ring class field associated to an order of an imaginary quadratic field. We compare the heights of our invariants by giving a general formu...
متن کاملGeneralised Bent Criteria for Boolean Functions (I)
Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown that the orbit generated by successive Local Complementations on a graph can be found within the transform spectra under investigation. The flat spectra of ...
متن کاملOn the Neutralino as Dark Matter Candidate. I. Relic Abundance.
The neutralino relic abundance is evaluated for a wide range of the neutralino mass, 20 GeV ≤ mχ ≤ 1 TeV, by taking into account the full set of final states in the neutralino-neutralino annihilation. The analysis is performed in the Minimal SuSy Standard Model; it is not restricted by stringent GUT assumptions but only constrained by present experimental bounds. We also discuss phenomenologica...
متن کاملOn Generalised Kneser Colourings
There are two possible definitions of the “s-disjoint r-uniform Kneser hypergraph” of a set system T : The hyperedges are either r-sets or r-multisets. We point out that Ziegler’s (combinatorial) lower bound on the chromatic number of an s-disjoint r-uniform Kneser hypergraph only holds if we consider r-multisets as hyperedges. We give a new proof of his result and show by example that a simila...
متن کاملGeneralised Test = Generalised Inference
Tim Menzies Dept. of Software Development, Monash University, Australia [email protected]; http://www.sd.monash.edu.au/ timm Abstract|We are used to viewing veri cation and validation as tasks to be performed after a knowledge-base is built. In this standard view, the inference engine is built rst, the knowledge base is then lled out, then nally a test engine is added to verify or va...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications of the Research Institute for Mathematical Sciences
سال: 2020
ISSN: 0034-5318
DOI: 10.4171/prims/56-2-3